An Automatic Deadlock Detection Method with Extension of Deadlock Pattern for Workflow Models
نویسندگان
چکیده
منابع مشابه
An Automatic Technique for Static Deadlock Prevention
Deadlocks remain one of the biggest threats to concurrent programming. Usually, the best programmers can expect is dynamic deadlock detection, which is only a palliative. Object-oriented programs, with their rich reference structure and the resulting presence of aliasing, raise additional problems. The technique developed in this paper relies on the “alias calculus” to offer a completely static...
متن کاملCommunication Deadlock Detection of Inter-organizational Workflow Definition
As the needs for interconnections of processes in different companies or departments are so increasing and companies try to realize business processes across organizational boundaries, the correctness issues of inter-organizational workflow definition is getting more important. In this paper, we develop community process definition language(CPDL) for inter-organizational workflow specification....
متن کاملDeadlock Detection with Stubborn Unfoldings
Stubborn sets and model unfolding are two well-known methods for sidestepping the complexity of state-space exploration based on formal models of concurrent programs, such as Labeled Transition Systems and Petri nets. Here we define a deadlock detection strategy that combines these two methods. We also show that the resulting method, stubborn unfoldings, can produce smaller state space represen...
متن کاملDeadlock detection of Java Bytecode
This paper presents a technique for deadlock detection of Java programs. The technique uses typing rules for extracting infinitestate abstract models of the dependencies among the components of the Java intermediate language – the Java bytecode. Models are subsequently analysed by means of an extension of a solver that we have defined for detecting deadlocks in process calculi. Our technique is...
متن کاملComputation Tree Logic with Deadlock Detection
We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL−X). This relation is obtained by De Nicola & Vaandrager by translating labelled transition systems to Kripke structures, while lifting the totality restriction on the latter. They characterised it as divergence sensitive branch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2000
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.120.12_1972